Basedon Adaptive Split - and - Merge andQualitative Spatial Reasoning
نویسندگان
چکیده
The ultimate goal of automatic document processing is to understand the semantics of a document. Towards such an end, one of the primary enabling steps has been to rst reason about the layout of the document by means of page segmentation and segment spatial reasoning or labeling. This, in turn, allows for the derivation of document logical organization. This paper describes a generic document segmentation and geometric relation labeling method with applications to Chinese document analysis. Unlike the previous document seg-mentation methods where text spacing, border lines, and/or a priori layout models based template matching processing are performed, the present method begins with a hierarchy of partitioned image layers where inhomogeneous higher-level regions are recursively partitioned into lower-level rectangular subregions and at the same time lower-level smaller homogeneous regions are merged into larger homogeneous regions. Furthermore, the derived segment data structure readily enables eecient search for geometric relationships between identiied document segments.
منابع مشابه
Edge-based Partition Coding for Fractal Image Compression
This paper presents an approach for fractal image compression that yields the best performance compared to fractal methods that do not rely on hybrid transform coding. The achievement is obtained using the standard algorithm in which the image is partitioned into non-overlapping range blocks which are approximated by corresponding larger domain blocks with image intensities that are affinely si...
متن کاملVisualization of Splitting and Merging Processes
Information about objects that split or merge is often generated dynamically as a by-product of computation or in the observation of real-world behavior. Visualization tools for such processes must not only reveal temporal patterns and spatial organization but should also accommodate on-the-fly generation of split-merge information. This paper develops a formal structure for split-merge process...
متن کاملScaling-up Split-Merge MCMC with Locality Sensitive Sampling (LSS)
Split-Merge MCMC (Monte Carlo Markov Chain) is one of the essential and popular variants of MCMC for problems when an MCMC state consists of an unknown number of components. It is well known that state-of-the-art methods for split-merge MCMC do not scale well. Strategies for rapid mixing requires smart and informative proposals to reduce the rejection rate. However, all known smart proposals in...
متن کاملMotion Estimation with Quadtree Splines - Pattern Analysis and Machine Intelligence, IEEE Transactions on
This paper presents a motion estimation algorithm based on a new multiresolution representation, the quadtree spline. This representation describes the motion field as a collection of smoothly connected patches of varying size, where the patch size is automatically adapted to the complexity of the underlying motion. The topology of the patches is determined by a quadtree data structure, and bot...
متن کاملOptimization of GMM training for speaker verification
EM training of GMM often suffers from the existence of local maxima and singularities in the likelihood space. In this paper, we present a new Modified Split-and-Merge EM algorithm (MSMEM) for speaker verification tasks, which performs split-and-merge operations to escape from local maxima and reduce the chances of generating singularities. With two modified criteria to select split-and-merge c...
متن کامل